package com.lisp.algorithm.test.sort;

public class AvlTree {
	
	private static Node root = null;
	
	public static void main(String[] args) {
		
	}
	
	public static void insert(int key) {
		if(root == null) {
			root = new Node(key, null, null, null, 1);
		} else {
			insert(root, key);
		}
	}

	private static void insert(Node n, int key) {
		
	}

	static class Node {
		private int key;
		private Node left;
		private Node right;
		private Node parent;
		private int height;
		public Node(int key, Node left, Node right, Node parent, int height) {
			super();
			this.key = key;
			this.left = left;
			this.right = right;
			this.parent = parent;
			this.height = height;
		}
	}
}
